On complete subgraphs of r-chromatic graphs
نویسندگان
چکیده
منابع مشابه
On complete subgraphs of r-chromatic graphs
Let G,J n) be an r-chromatic graph with n vertices in each colour class . Suppose G = G 3 (n), and t (G) . the minimal degree in G, is at least n + t (t _> 1) . We prove that C contains at least t 3 triangles but does not have to contain more titan 4t 3 of them . Furthermore, we give lower bounds for s such that G contains a complete 3-partite graph with s vertices in each class . Let';.(ii) = ...
متن کاملComplete Subgraphs of Chromatic Graphs and Hypergraphs
In this note we consider k-chromatic graphs with given colour k r-graphs have vertex sets u C i , and no r-tuple (i .e. edge o f 1 the r-graph) has two vertices in the same colour class C i .
متن کاملComplete r-partite subgraphs of dense r-graphs
Let r ≥ 3 and (lnn)−1/(r−1) ≤ α ≤ r−3. We show that: Every r-uniform graph on n vertices with at least αnr/r! edges contains a complete r-partite graph with r − 1 parts of size ⌊ α (lnn)1/(r−1) ⌋ and one part of size ⌈ n1−α r−2 ⌉ . This result follows from a more general digraph version: Let U1, . . . , Ur be sets of size n, and M ⊂ U1 × · · · × Ur satisfy |M | ≥ αnr. If the integers s1, . . . ...
متن کاملOn Complete Topological Subgraphs of Certain Graphs
Let G he a graph . We say that G contains a complete k-gon if there are !c vertices of G any two of which are connected by an edge, we say that it contains a complete topological k-gon if it contains k vertices any two of which are connected by paths no two of which have a common vertex (except endpoints) . Following G . DIRAC we will denote complete k-gons by -k = and complete topological k-go...
متن کاملOn complete subgraphs of color-critical graphs
A graph G is called k-critical if x(G) = k and x(G e) -C x(G) for each edge e of G, where x denotes the chromatic number. T. Gallai conjectured that every k-critical graph of order n contains at most n complete (k l)-subgraphs. In 1987, Stiebitz proved Gallai’s conjecture in the case k = 4, and in 1992 Abbott and Zhou proved Gallai’s conjecture for all k > 5. In their paper, Abbott and Zhou ask...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1975
ISSN: 0012-365X
DOI: 10.1016/0012-365x(75)90011-4